Bounds for the Tail Distribution in a Queue with the Superposition of General Periodic Markov Sources
نویسندگان
چکیده
In this paper, we derive the bounds formulas for the asymptotic tail distribution in a queue whose arrival process is a superposition of general periodic Markov sources. Note that we make no assumption for the structure of the general periodic Markov sources except that the underlying Markov chains are irreducible. The periodic source model in this paper is thus rather general. Taking initial state conditions of the periodic sources into account, we construct a superposed arrival process. Contrary to the previous works, this implies that the periodic sources are not independent. We also provide examples to investigate the e ciency and the accuracy of our bound formulas.
منابع مشابه
Bounds for the tail distribution in a queue with a superposition of general periodic Markov sources: theory and application
An efficient yet accurate estimation of the tail distribution of the queue length has been considered as one of the most important issues in call admission and congestion controls in ATM networks. The arrival process in ATM networks is essentially a superposition of sources which are typically bursty and periodic either due to their origin or their periodic slot occupation after traffic shaping...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملBiased Initial Distribution for Simulation of Queues with a Superposition of Periodic and Bursty Sources
In this paper, we focus on queues with a superposition of periodic and bursty sources where the initial states of the sources are randomly and independently selected. The dynamics of the queue are described as a reducible Markov chain. For such queues, we consider the tail probability of the queue length as the performance measure and try to estimate it by simulations. To do simulation efficien...
متن کاملA stochastic version analysis of an M/G/1 retrial queue with Bernoulli schedule
In this work, we derive insensitive bounds for various performance measures of a single-server retrial queue with generally distributed inter-retrial times and Bernoulli schedule, under the special assumption that only the customer at the head of the orbit queue (i.e., a FCFS discipline governing the flow from the orbit to the server) is allowed to occupy the server. The method...
متن کاملA Storage Model with High Rate and Long RangeDependent On / O Sources
We consider a uid queueing problem with an innnite reservoir with output rate C, fed by an innnite superposition of identical On/OO sources with large instantaneous bit rate h C. The On periods have innnite variance, generating Long Range Dependence. It is shown that the distribution of the stationary queue content at embedded time points is heavy tailed with innnite mean. It is explained why t...
متن کامل